SOME COMPARISON RESULTS FOR MOVING LEAST-SQUARE APPROXIMATIONS
نویسندگان
چکیده
منابع مشابه
A meshless Galerkin method with moving least square approximations for infinite elastic solids∗
Combining moving least square approximations and boundary integral equations, a meshless Galerkin method, which is the Galerkin boundary node method (GBNM), for twoand three-dimensional infinite elastic solid mechanics problems with traction boundary conditions is discussed. In this numerical method, the resulting formulation inherits the symmetry and positive definiteness of variational proble...
متن کاملRecent Results for Moving Least Squares Approximation
We describe two experiments recently conducted with the approximate moving least squares (MLS) approximation method. On the one hand, the NFFT library of Kunis, Potts, and Steidl is coupled with the approximate MLS method to obtain a fast and accurate multivariate approximation method. The second experiment uses approximate MLS approximation in combination with a multilevel approximation algori...
متن کاملLeast Square Approximations and Conic Values of Cooperative Games
The problem of least square approximation for set functions by set functions satisfying specified linear equality or inequality constraints is considered. The problem has important applications in the field of pseudoBoolean functions, decision making and in cooperative game theory, where approximation by additive set functions yields so-called least square values. In fact, it is seen that every...
متن کاملLeast Square Approximations and Linear Values of Cooperative Games
Many important values for cooperative games are known to arise from least square optimization problems. The present investigation develops an optimization framework to explain and clarify this phenomenon in a general setting. The main result shows that every linear value results from some least square approximation problem and that, conversely, every least square approximation problem with line...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2016
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v109i1.11